96 research outputs found

    Permutation Statistics on the Alternating Group

    Get PDF
    Let AnβŠ†SnA_n\subseteq S_n denote the alternating and the symmetric groups on 1,...,n1,...,n. MacMahaon's theorem, about the equi-distribution of the length and the major indices in SnS_n, has received far reaching refinements and generalizations, by Foata, Carlitz, Foata-Schutzenberger, Garsia-Gessel and followers. Our main goal is to find analogous statistics and identities for the alternating group AnA_{n}. A new statistic for SnS_n, {\it the delent number}, is introduced. This new statistic is involved with new SnS_n equi-distribution identities, refining some of the results of Foata-Schutzenberger and Garsia-Gessel. By a certain covering map f:An+1β†’Snf:A_{n+1}\to S_n, such SnS_n identities are `lifted' to An+1A_{n+1}, yielding the corresponding An+1A_{n+1} equi-distribution identities.Comment: 45 page

    On Degrees in the Hasse Diagram of the Strong Bruhat Order

    Full text link
    For a permutation Ο€\pi in the symmetric group SnS_n let the {\it total degree} be its valency in the Hasse diagram of the strong Bruhat order on SnS_n, and let the {\it down degree} be the number of permutations which are covered by Ο€\pi in the strong Bruhat order. The maxima of the total degree and the down degree and their values at a random permutation are computed. Proofs involve variants of a classical theorem of Tur\'an from extremal graph theory.Comment: 14 pages, minor corrections; to appear in S\'em. Lothar. Combi

    Equidistribution and Sign-Balance on 321-Avoiding Permutations

    Full text link
    Let TnT_n be the set of 321-avoiding permutations of order nn. Two properties of TnT_n are proved: (1) The {\em last descent} and {\em last index minus one} statistics are equidistributed over TnT_n, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for T2nT_{2n} and T2n+1T_{2n+1} are essentially equal to the last-descent enumerator for TnT_n. The proofs use a recursion formula for an appropriate multivariate generating function.Comment: 17 pages; to appear in S\'em. Lothar. Combi
    • …
    corecore